Comparing Natural Product (NP) and non-NP datasets at an atomic scale
نویسندگان
چکیده
منابع مشابه
Comparing Natural Product (NP) and non-NP datasets at an atomic scale
Understanding the basic chemical composition of secondary natural products (NP) will help to design NP like agents more efficiently. This should lead to an elaborated comprehension of the biosynthetic origin of natural products and to an efficient way to simulate and to imitate these structures in research and development, especially since it is known that natural and natural like products diff...
متن کاملSpeedup for Natural Problems and NP=?coNP
Informally, a language L has speedup if, for any Turing machine (TM) for L, there exists one that is better. Blum [2] showed that there are computable languages that have almost-everywhere speedup. These languages were unnatural in that they were constructed for the sole purpose of having such speedup. We identify a condition apparently only slightly stronger than P 6= NP which implies that acc...
متن کاملComparing Reductions to NP-Complete Sets
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: 1. Adaptive reductions are more powerful than nonadaptive reductions: there is a problem that is Turing-complete for NP but not truth-table-complete. 2. Strong nondeterministic reductions are more powerful than deterministic reductions: there is a problem that is SNP-co...
متن کاملProduct-Free Lambek Calculus Is NP-Complete
In this paper we prove that the derivability problems for productfree Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a new derivability characterization for these calculi.
متن کاملNP-Completeness and Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A,B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemistry Central Journal
سال: 2008
ISSN: 1752-153X
DOI: 10.1186/1752-153x-2-s1-p25